An explicit construction of Euler circuits in shuffle nets and related networks
نویسندگان
چکیده
In this paper we present a consttuction of Euler circuits. for some circular multistage interconnection networks, which have a uniform structure-betwee'n consecutive stages. • Compqter Science. Department, Technion, Israel Institute of Technology, Haif~, ISRAEL. •• Electrical Engineering Department, Technion, Israel Institute of Technology, Haifa, ISRAEL. T ec hn io n C om pu te r Sc ie nc e D ep ar tm en t T eh ni ca l R ep or t C S0 53 9 19 89
منابع مشابه
Explicit Double Shuffle Relations and a Generalization of Euler’s Decomposition Formula
We give an explicit formula for the shuffle relation in a general double shuffle framework that specializes to double shuffle relations of multiple zeta values and multiple polylogarithms. As an application, we generalize the well-known decomposition formula of Euler that expresses the product of two Riemann zeta values as a sum of double zeta values to a formula that expresses the product of t...
متن کاملImplementing the New First and Second Differentiation of a General Yield Surface in Explicit and Implicit Rate-Independent Plasticity
In the current research with novel first and second differentiations of a yield function, Euler forward along with Euler backward with its consistent elastic-plastic modulus are newly implemented in finite element program in rate-independent plasticity. An elastic-plastic internally pressurized thick walled cylinder is analyzed with four famous criteria including both pressure dependent and ind...
متن کاملAccessibility Evaluation in Biometric Hybrid Architecture for Protecting Social Networks Using Colored Petri Nets
In the last few decades, technological progress has been made important information systems that require high security, Use safe and efficient methods for protecting their privacy. It is a major challenge to Protecting vital data and the ability to threaten attackers. And this has made it important and necessary to be sensitive to the authentication and identify of individuals in confidential n...
متن کاملOn a sequence related to the coprime integers
The asymptotic behaviour of the sequence with general term $P_n=(varphi(1)+varphi(2)+cdots+varphi(n))/(1+2+cdots+n)$, is studied which appears in the studying of coprime integers, and an explicit bound for the difference $P_n-6/pi^2$ is found.
متن کاملEfficient Zero-Knowledge Argument for Correctness of a Shuffle
Mix-nets are used in e-voting schemes and other applications that require anonymity. Shuffles of homomorphic encryptions are often used in the construction of mix-nets. A shuffle permutes and reencrypts a set of ciphertexts, but as the plaintexts are encrypted it is not possible to verify directly whether the shuffle operation was done correctly or not. Therefore, to prove the correctness of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 22 شماره
صفحات -
تاریخ انتشار 1992